Modal Logic for Preference Based on Reasons

نویسندگان

  • Daniel N. Osherson
  • Scott Weinstein
چکیده

We discuss the logic of preferences, introducing modal connectives that reflect reasons to prefer that one formula rather than another be true. An axiomatic analysis of two such logics is presented.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Preference based on Reasons

We describe a logic of preference in which modal connectives reflect reasons to desire that a sentence be true. Various conditions on models are introduced and analyzed.

متن کامل

Arrow Decision Logic

In this paper, we propose arrow decision logic (ADL), which combines the main features of decision logic and arrow logic. Decision logic represents and reasons about knowledge extracted from decision tables based on rough set theory, while arrow logic is the basic modal logic of arrows. The semantic models of ADL are pairwise comparison tables, which are useful in rough set-based multicriteria ...

متن کامل

Suhrawardi's Modal Syllogisms

Suhrawardi’s logic of the Hikmat al-Ishraq is basically modal. So to understand his modal logic one first has to know the non-modal part upon which his modal logic is built. In my previous paper ‘Suhrawardi on Syllogisms’(3) I discussed the former in detail. The present paper is an exposition of his treatment of modal syllogisms. On the basis of some reasonable existential presuppositi...

متن کامل

Von Wright’s preference logic reconsidered

A logic of preference does not pertain to the formation of preferences, but rather to a pre-established hierarchy of alternatives, ordered by some underlying relation. A wide variety of relations, corresponding to reasons behind the ordering of alternatives, may be seen as preference relations. For example, alternatives may be ordered by the pleasure or utility they bring about, they may be ran...

متن کامل

Path Constraints from a Modal Logic Point of View

We analyze several classes of path constraints for semistructured data in a unified framework and prove some decidability and complexity results for these constraints by embedding them in Propositional Dynamic Logic. While some of our decidability results were known before, we believe that our improved complexity bounds are new. Our proofs, based on techniques from modal logic, shed additional ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013